Novel Global Harmony Search Algorithm for Least Absolute Deviation
نویسندگان
چکیده
منابع مشابه
Improved Harmony Search Algorithm with Chaos for Absolute Value Equation
In this paper, an improved harmony search with chaos (HSCH) is presented for solving NP-hard absolute value equation (AVE) Ax |x| = b, where A is an arbitrary square matrix whose singular values exceed one. The simulation results in solving some given AVE problems demonstrate that the HSCH algorithm is valid and outperforms the classical HS algorithm (HS) and HS algorithm with differential muta...
متن کاملAnalysis of least absolute deviation
The least absolute deviation or L1 method is a widely known alternative to the classical least squares or L2 method for statistical analysis of linear regression models. Instead of minimizing the sum of squared errors, it minimizes the sum of absolute values of errors. Despite its long history and many ground-breaking works (cf. Portnoy and Koenker (1997) and references therein), the former has...
متن کاملSystem Identification Using Reweighted Zero Attracting Least Absolute Deviation Algorithm
In this paper, the l1 norm penalty on the filter coefficients is incorporated in the least mean absolute deviation (LAD) algorithm to improve the performance of the LAD algorithm. The performance of LAD, zero-attracting LAD (ZA-LAD) and reweighted zero-attracting LAD (RZA-LAD) are evaluated for linear time varying system identification under the non-Gaussian (α-stable) noise environments. Effec...
متن کاملImproved Cuckoo Search Algorithm for Global Optimization
The cuckoo search algorithm is a recently developedmeta-heuristic optimization algorithm, which is suitable forsolving optimization problems. To enhance the accuracy andconvergence rate of this algorithm, an improved cuckoo searchalgorithm is proposed in this paper. Normally, the parametersof the cuckoo search are kept constant. This may lead todecreasing the efficiency of the algorithm. To cop...
متن کاملA Novel Hybrid Cuckoo Search Algorithm with Global Harmony Search for 0-1 Knapsack Problems
Cuckoo search (CS) is a novel biologically inspired algorithm and has been widely applied to many fields. Although some binary-coded CS variants are developed to solve 0-1 knapsack problems, the search accuracy and the convergence speed are still needed to further improve. According to the analysis of the shortcomings of the standard CS and the advantage of the global harmony search (GHS), a no...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Mathematics
سال: 2014
ISSN: 1110-757X,1687-0042
DOI: 10.1155/2014/632975